Linear extensions and order-preserving poset partitions
نویسندگان
چکیده
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving partitions) of a finite n-element poset P with n ≥ 3 is homotopy equivalent to a wedge of spheres of dimension n − 3. If P is connected, then the number of spheres is equal to the number of linear extensions of P . In general, the number of spheres is equal to the number of cyclic extensions of P .
منابع مشابه
A Self-dual Hopf Algebra on Double Partially Ordered Sets
Let D be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On ZD we define a product and a coproduct, together with an internal product, that is, degree-preserving. With these operations ZD is a Hopf algebra, self-dual with respect to a scalar product which counts the number of pictures (in the sense of Zelevinsky) between two do...
متن کاملON q-INTEGRALS OVER ORDER POLYTOPES
A combinatorial study of multiple q-integrals is developed. This includes a q-volume of a convex polytope, which depends upon the order of q-integration. A multiple q-integral over an order polytope of a poset is interpreted as a generating function of linear extensions of the poset. Specific modifications of posets are shown to give predictable changes in q-integrals over their respective orde...
متن کاملSome Remarks on Sign-Balanced and Maj-Balanced Posets
Let P be an n-element poset (partially ordered set), and let ω : P → [n] = {1, 2, . . . , n} be a bijection, called a labeling of P . We call the pair (P, ω) a labelled poset. A linear extension of P is an order-preserving bijection f : P → [n]. We can regard f as defining a permutation π = π(f) of the set [n] given by π(i) = j if f(ω(j)) = i. We write π in the customary way as a word a1a2 · · ...
متن کاملUsing TPA to count linear extensions
A linear extension of a poset P is a permutation of the elements of the set that respects the partial order. Let L(P ) denote the number of linear extensions. It is a #P complete problem to determine L(P ) exactly for an arbitrary poset, and so randomized approximation algorithms that draw randomly from the set of linear extensions are used. In this work, the set of linear extensions is embedde...
متن کاملThe Linear Discrepancy of a Fuzzy Poset
In 2001, the notion of a fuzzy poset defined on a set X via a triplet (L,G, I) of functions with domain X ×X and range [0, 1] satisfying a special condition L+G+ I = 1 is introduced by J. Negger and Hee Sik Kim, where L is the ‘less than’ function, G is the ‘greater than’ function, and I is the ‘incomparable to’ function. Using this approach, we are able to define a special class of fuzzy poset...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 122 شماره
صفحات -
تاریخ انتشار 2014